Completeness of Depth-bounded Resolution for Weakly Reducing Programs
نویسنده
چکیده
In this paper we present the class of general logic programs which has a special kind of stratiications, called the locally nite stratiication. For the class, good properties of propositional logic programs, such as termination and safeness, are preserved. Using these properties, we show the completeness of a kind of SLDNF-resolution that use a depth bound, called depth bounded resolution, with respect to the perfect model semantics. Finally we syntactically characterize a subclass of the class, called weakly reducing programs and show that the depth bounded resolution is complete and eeective for weakly reducing programs.
منابع مشابه
ON FELBIN’S-TYPE FUZZY NORMED LINEAR SPACES AND FUZZY BOUNDED OPERATORS
In this note, we aim to present some properties of the space of all weakly fuzzy bounded linear operators, with the Bag and Samanta’s operator norm on Felbin’s-type fuzzy normed spaces. In particular, the completeness of this space is studied. By some counterexamples, it is shown that the inverse mapping theorem and the Banach-Steinhaus’s theorem, are not valid for this fuzzy setting. Also...
متن کاملWeakly-Synchronized Ground Tree Rewriting
Ground tree rewrite systems (GTRS) are a well-known treeextension of prefix-rewrite systems on words (a.k.a. pushdown systems), where subtrees (instead of word prefixes) are rewritten. GTRS can model programs with unbounded recursion depth and thread-spawning, wherein the threads have a tree-shaped dependency graph. We consider the extension of GTRS with a finite (global) control unit for synch...
متن کاملCompleteness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملA Comparison of Weak Completeness Notions 1 Extended
We compare the weak completeness notions for E in the sense of Lutz's resource-bounded measure theory 11] with respect to the standard polynomial time reducibilities. Our results parallel results for classical completeness by Watanabe 17] and others. We show that the weak completeness notions for 1-query reductions coincide: A set is weakly complete for E under 1-truth-table reducibility ii it ...
متن کاملUniform Convergence to a Left Invariance on Weakly Compact Subsets
Let $left{a_alpharight}_{alphain I}$ be a bounded net in a Banach algebra $A$ and $varphi$ a nonzero multiplicative linear functional on $A$. In this paper, we deal with the problem of when $|aa_alpha-varphi(a)a_alpha|to0$ uniformly for all $a$ in weakly compact subsets of $A$. We show that Banach algebras associated to locally compact groups such as Segal algebras and $L^1$-algebras are resp...
متن کامل